An Arakelov-theoretic approach to näıve heights on hyperelliptic Jacobians

نویسندگان

  • David Holmes
  • DAVID HOLMES
چکیده

We use Arakelov theory to define a height on divisors of degree zero on a hyperelliptic curve over a global field, and show that this height has computably bounded difference from the Néron–Tate height of the corresponding point on the Jacobian. We give an algorithm to compute the set of points of bounded height with respect to this new height. This provides an ‘in principle’ solution to the problem of determining the sets of points of bounded Néron–Tate heights on the Jacobian. We give a worked example of how to compute the bound over a global function field for several curves, of genera up to 11.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Canonical Heights on Hyperelliptic Curves

We describe an algorithm to compute canonical heights of points on hyperelliptic curves over number fields, using Arakelov geometry. We include a worked example for illustration purposes.

متن کامل

Computing Néron-tate Heights of Points on Hyperelliptic Jacobians

It was shown by Faltings ([Fal84]) and Hriljac ([Hri85]) that the Néron-Tate height of a point on the Jacobian of a curve can be expressed as the self-intersection of a corresponding divisor on a regular model of the curve. We make this explicit and use it to give an algorithm for computing Néron-Tate heights on Jacobians of hyperelliptic curves. To demonstrate the practicality of our algorithm...

متن کامل

Decomposing Jacobians of Hyperelliptic Curves

Many interesting questions can be asked about the decomposition of Jacobians of curves. For instance, we may want to know which curves have completely decomposable Jacobians (Jacobians which are the product of g elliptic curves) [4]. We may ask about number theoretic properties of the elliptic curves that show up in the decomposition of Jacobians of curves [2]. We would also like to know how ma...

متن کامل

Explicit p-adic methods for elliptic and hyperelliptic curves

We give an overview of some p-adic algorithms for computing with elliptic and hyperelliptic curves, starting with Kedlaya’s algorithm. While the original purpose of Kedlaya’s algorithm was to compute the zeta function of a hyperelliptic curve over a finite field, it has since been used in a number of applications. In particular, we describe how to use Kedlaya’s algorithm to compute Coleman inte...

متن کامل

Isogenies and the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves

We describe the use of explicit isogenies to reduce Discrete Logarithm Problems (DLPs) on Jacobians of hyperelliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, which are vulnerable to faster index calculus attacks. We provide algorithms which compute an isogeny with kernel isomorphic to (Z/2Z) for any hyperelliptic genus 3 curve. These algorithms provide a rational isogeny...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014